On Regular Factors in Regular Graphs with Small Radius
نویسندگان
چکیده
منابع مشابه
On Regular Factors in Regular Graphs with Small Radius
In this note we examine the connection between vertices of high eccentricity and the existence of k-factors in regular graphs. This leads to new results in the case that the radius of the graph is small (≤ 3), namely that a d-regular graph G has all k-factors, for k|V (G)| even and k ≤ d, if it has at most 2d+2 vertices of eccentricity > 3. In particular, each regular graph G of diameter ≤ 3 ha...
متن کاملIdentifying Codes with Small Radius in Some Infinite Regular Graphs
Let G = (V,E) be a connected undirected graph and S a subset of vertices. If for all vertices v ∈ V , the sets Br(v) ∩ S are all nonempty and different, where Br(v) denotes the set of all points within distance r from v, then we call S an r-identifying code. We give constructive upper bounds on the best possible density of r-identifying codes in four infinite regular graphs, for small values of r.
متن کاملRegular factors in regular graphs
Katerinis, P., Regular factors in regular graphs, Discrete Mathematics 113 (1993) 269-274. Let G be a k-regular, (k I)-edge-connected graph with an even number of vertices, and let m be an integer such that 1~ m s k 1. Then the graph obtained by removing any k m edges of G, has an m-factor. All graphs considered are finite. We shall allow graphs to contain multiple edges and we refer the reader...
متن کاملRegular Factors in Graphs
Diese Dissertation ist auf den Internetseiten der Hochschulbibliothek online verfügbar. Preface Many fields of mathematics are concerned with determining the smallest parts, or factors, of a certain kind, which make up a given object. Probably the best known examples in mathematics are the factorization of non-negative integers with prime numbers or the decomposition of polynomials. It was a pr...
متن کاملRegular Factors of Regular Graphs from Eigenvalues
Let r and m be two integers such that r > m. Let H be a graph with order |H|, size e and maximum degree r such that 2e > |H|r−m. We find a best lower bound on spectral radius of graph H in terms of m and r. Let G be a connected r-regular graph of order |G| and k < r be an integer. Using the previous results, we find some best upper bounds (in terms of r and k) on the third largest eigenvalue th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2004
ISSN: 1077-8926
DOI: 10.37236/1760